Recognizing Union-Find trees is NP-complete
نویسندگان
چکیده
منابع مشابه
Recognizing Union-Find trees is NP-complete
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression). In this paper we provide such a characterization and show that...
متن کاملRecognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete
Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression) for the case assuming union-by-rank strategy for merging. In t...
متن کاملRecognizing Shrinkable Complexes Is NP-Complete
We say that a simplicial complex is shrinkable if there exists a sequence of admissible edge contractions that reduces the complex to a single vertex. We prove that it is NP-complete to decide whether a (two-dimensional) simplicial complex is shrinkable. Along the way, we describe examples of contractible complexes that are not shrinkable.
متن کاملPartitionability to two trees is NP-complete
We show that P2T-the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not-is NP-complete. It is a well known that deciding whether the edge set of a graph can be partitioned into k spanning trees or not is in P [1]. Recently András Frank asked what we know about partitioning the edge set of a graph into k (not necessarily spanning) trees. One can e...
متن کاملRecognizing Renamable Generalized Propositional Horn Formulas Is NP-complete
Yamasaki and Doshita have defined an extension of the class of propositional Horn formulas; later, Gallo and Scutellà generalized this class to a hierarchy Γ0 ⊆ Γ1 ⊆ . . . ⊆ Γk ⊆ . . ., where Γ0 is the set of Horn formulas and Γ1 is the class of Yamasaki and Doshita. For any fixed k, the propositional formulas in Γk can be recognized in polynomial time, and the satisfiability problem for Γk for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2018
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2017.11.003